On Goulden-jackson’s Determinantal Expression for the Immanant
نویسنده
چکیده
In 1992, Goulden and Jackson found a beautiful determinantal expression for the immanant of a matrix. This paper proves the same result combinatori-ally.
منابع مشابه
On Goulden-jackson’s Determinantal Formula for the Immanant
In 1992, Goulden and Jackson found a beautiful determinantal expression for the immanant of a matrix. This paper proves the same result combinatorially. We also present a β-extension of the theorem and a simple determinantal expression for the irreducible characters of the symmetric group.
متن کاملA Quantization of a theorem of Goulden and Jackson
A theorem of Goulden and Jackson which gives interesting formulae for character immanants also implies MacMahon’s Master Theorem. We quantize Goulden and Jackson’s theorem to give formulae for quantum character immanants in such a way as to obtain a known quantization of MacMahon’s Master Theorem due to Garoufalidis-LêZeilberger. In doing so, we also quantize formulae of Littlewood, Merris and ...
متن کاملOn Immanants of Jacobi-Trudi Matrices and Permutations with Restricted Position
Let Z be a character of the symmetric group 5P~. The immanant of an n x n matrix A = [-a•] with respect to X is Zw~snZ(w)al,,~(t)...an, w~,). Goulden and Jackson conjectured, and Greene recently proved, that immanants of Jacobi-Trudi matrices are polynomials with nonnegative integer coefficients. This led one of us (Stembridge) to formulate a series of conjectures involving immanants , some of ...
متن کاملMinimal transitive factorizations of a permutation of type (p, q)
We give a combinatorial proof of Goulden and Jackson’s formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number of maximal chains of annular noncrossing partitions of type B. Résumé. Nous donnons une preuve combinatoire de formule de Goulden et Jackson pour le nombre de f...
متن کاملA simple recurrence for covers of the sphere with branch points of arbitrary ramification
The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800’s. This problem translates combinatorially into factoring a permutation of specified cycle type, with certain conditions on the cycle types of the factors, such as minimality and transitivity. Goulden and Jackson have given a proof for the number of minimal, transitive facto...
متن کامل